Strong Duality for a Trust-Region Type Relaxation of QAP
نویسندگان
چکیده
منابع مشابه
Strong duality for a trust-region type relaxation of the quadratic assignment problem
Lagrangian duality underlies many efficient algorithms for convex minimization problems. A key ingredient is strong duality. Lagrangian relaxation also provides lower bounds for non-convex problems, where the quality of the lower bound depends on the duality gap. Quadratically constrained quadratic programs (QQPs) provide important examples of non-convex programs. For the simple case of one qua...
متن کاملSemidefinite Programming
3 Why Use SDP? 5 3.1 Tractable Relaxations of Max-Cut . . . . . . . . . . . . . . . . . . . . . . . . 5 3.1.1 Simple Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.2 Trust Region Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.3 Box Constraint Relaxation . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.4 Eigenvalue Bound . . . . . . . . . . . . ...
متن کاملTrust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as exact semidefinite linear programming relaxation (SDP-relaxation) and strong duality. Unfortunately, such properties do not, in general, hold for an extended trust-region proble...
متن کاملStrong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
In this paper we consider the problem of minimizing a nonconvex quadratic function, subject to two quadratic inequality constraints. As an application, such quadratic program plays an important role in the trust region method for nonlinear optimization; such problem is known as the CDT subproblem in the literature. The Lagrangian dual of the CDT subproblem is a Semidefinite Program (SDP), hence...
متن کاملEfficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number of extensions to this approach have also been proposed, ones that can deal with multiple classes or that can incorporate a priori information in the form of grouping constraints. It was recently shown how a general l...
متن کامل